Baron Münchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle
نویسندگان
چکیده
We investigate a coin-weighing puzzle that appeared in the 1991 Moscow Math Olympiad. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle that is noticeably better than the trivial upper bound. In particular, we show that logarithmically-many weighings on a balance suffice.
منابع مشابه
Baron Munchhausen's Sequence
We investigate a coin-weighing puzzle that appeared in the all-Russian Mathematics Olympiad in 2000. The methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of participating coins, and deduce a complete solution. Perhaps surprisingly, the objective can be achieved in no more than two weighings regardless of the number of coins involved.
متن کاملLower bounds on the Münchhausen problem
“The Baron’s omni-sequence”, B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with distinct integer weights between 1 gram and n grams. A trivial lower bound on B(n) is log3 n, and it has been shown that B(n) is log3 n + O(log log n). In thi...
متن کاملBaron Münchhausen and the syndrome which bears his name: history of an endearing personage and of a strange mental disorder.
Munchausen syndrome, a mental disorder, was named in 1951 by Richard Asher after Karl Friedrich Hieronymus, Baron Münchhausen (1720-1797), whose name had become proverbial as the narrator of false and ridiculously exaggerated exploits. The first edition of Münchhausen's tales appeared anonymously in 1785 (Baron Münchausen's narrative of his marvelous travels and campaigns in Russia), and was wr...
متن کاملAn Advanced Approach to Solve two Counterfeit Coins Problem
Though the counterfeit coin problem is well known as a fascinating puzzle it claims great importance in Computer science, Game theory, and Mathematics. In terms of the puzzle the objective is to detect the counterfeit coins which are identical in appearance but different in weight. The word counterfeit not only describes forgeries of currency or documents, but can also be applied to software, p...
متن کاملLower Bounds on Two Coin-Weighing Problems, with Applications to Threshold Circuits
Among a set of n coins of two weights (good and bad), and using a balance, we wish to determine the number of bad coins using as few measurements as possible. There is a known adaptive decision tree that answers this question in O((log(n))) measurements, and a slight modification of this decision tree determines the parity of the number of bad coins in O(log n). In this paper, we prove an Ω( √ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011